Signed star k-subdomination numbers in graphs
نویسندگان
چکیده
منابع مشابه
Signed star k-subdomination numbers in graphs
Let G be a simple graph without isolated vertex with vertex set V (G) and edge set E(G). A function f : E(G) −→ {−1, 1} is said to be a signed star k-subdominating function of G if ∑ e∈E(v) f (e) ≥ 1 for at least k vertices v of G, where E(v) = {uv ∈ E(G) | u ∈ N (v)}. The value min ∑ e∈E(G) f (e), taking over all signed star k-subdominating function f of G is called the signed star k-subdomina...
متن کاملSigned edge k-subdomination numbers in graphs
The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a signed edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all signed edge k-subdomina...
متن کاملMinus edge k-subdomination numbers in graphs
The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 0, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a minus edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all minus edge k-subdomin...
متن کاملk-Subdomination in graphs
For a positive integer k, a k-subdominating function of a graph G=(V; E) is a function f :V →{−1; 1} such that ∑u∈NG [v] f(u)¿ 1 for at least k vertices v of G. The ksubdomination number of G, denoted by ks(G), is the minimum of ∑ v∈V f(v) taken over all k-subdominating functions f of G. In this article, we prove a conjecture for k-subdomination on trees proposed by Cockayne and Mynhardt. We al...
متن کاملThe Signed k-Domination Numbers In Graphs
For any integer k ≥ 1, a signed (total) k-dominating function is a function f : V (G) → {−1, 1} satisfying w∈N [v] f(w) ≥ k ( P w∈N(v) f(w) ≥ k) for every v ∈ V (G), where N(v) = {u ∈ V (G)|uv ∈ E(G)} and N [v] = N(v)∪{v}. The minimum of the values ofv∈V (G) f(v), taken over all signed (total) k-dominating functions f, is called the signed (total) k-domination number and is denoted by γkS(G) (γ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.01.020